Accuracy-Guaranteed Bit-Width Optimization
نویسندگان
چکیده
منابع مشابه
Precision Modeling and Bit-width Optimization of Floating-Point Applications
We present a floating-point precision modeling methodology that can be used to develop application adaptive arithmetic precision models for variable bitwidth floating-point computing. We also developed optimization algorithms that minimize the total bit-width for the application such that the output accuracy meets user-defined requirements. The methodology supports different bit-widths for diff...
متن کاملOn Guaranteed Accuracy Computation
The concept of guaranteed accuracy computation is a natural one: the user could specify any á priori relative or absolute precision bound on the numerical values which are to be computed in an algorithm. It is a generalization of guaranteed sign computation, a concept originally proposed to solve the ubiquitous problem of non-robustness in geometric algorithms. In this paper, we investigate som...
متن کاملNarrow-width approximation accuracy
A study of general properties of the narrow-width approximation (NWA) with polarization/spin decorrelation is presented. We prove for sufficiently inclusive differential rates of arbitrary resonant decay or scattering processes with an on-shell intermediate state decaying via a cubic or quartic vertex that decorrelation effects vanish and the NWA is of order Γ. Its accuracy is then determined n...
متن کاملBit-Width Analysis for General Applications
It has been widely known that a significant part of the bits are useless or even unused during the program execution. Bit-width analysis targets at finding the minimum bits needed for each variable in the program, which ensures the execution correctness and resources saving. In this paper, we proposed a static analysis method for bit-widths in general applications, which approximates conservati...
متن کاملAdvances in Bit Width Selection Methodology
We describe a method for the formal determination of signal bit width in fixed points VLSI implementations of signal processing algorithms containing loop nests. The main advance of this paper lies in the fact that we use results of the (max,+) algebraic theory to find the integral bit width of algorithms containing loop nests whose bound parameters are not statically known. Combined with recen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2006
ISSN: 0278-0070
DOI: 10.1109/tcad.2006.873887